New characterizations for the multi-output correlation-immune Boolean functions
نویسندگان
چکیده
منابع مشابه
Decomposition of Multi-Output Boolean Functions∗
In this paper the problem of decomposition, mapping and minimization of multi-output boolean functions is discussed. First the mathematical formulation for single-output boolean functions is presented and then it is extended to multi-output functions. The proposed formulations use function decompositions, ETDDs (EXOR ternary decision diagrams) and multi-valued logic.
متن کاملConstruction of correlation immune Boolean functions
It is shown in this paper that every correlation immune Boolean function of n variables can be written as f(x) = g(xG ), where 9 is an algebraic non-degenerate Boolean function of k (k :::; n) variables and G is a generating matrix of an tn, k, d] linear code. In this expression the correlation immunity of f(x) must be at least d 1. In this paper we further prove when the correlation immunity e...
متن کاملBased FPGA Synthesis for Multi - Output Boolean Functions
| One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f = (f 1 ; : : : ; f m ) : f0; 1g n ! f0; 1g m have to deal with is nding sublogic which can be shared by di erent outputs, i.e., nding boolean functions = ( 1 ; : : : ; h ) : f0; 1g p ! f0; 1g h which can be used as common sublogic of good realizations of f 1 ; : : : ; f m . In this paper we...
متن کاملImproved Asymptotic Formulas for Counting Correlation Immune Boolean Functions
A Boolean function is called correlation immune if every input is independent of the output, when the inputs are chosen from a uniform distribution. Such functions are of interest in machine learning and stream cipher design. We show how an asymptotic formula of Denisov, which approximately counts the n-variable correlation immune functions, can be improved so as to be accurate even for fairly ...
متن کاملCommunication based multilevel synthesis for multi-output Boolean functions
A multilevel logic synthesis technique for multi-output boolean functions is presented which is based on minimizing the communication complexity. Unlike the approaches known from literature [1, 5, 6, 8] which in the nal analysis decompose each single-output function f i of a multioutput function f = (f 1 ; . . . ; f m ) independently of the other single-output functions f j (j 6= i), the approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.112082